Diffuse Reflection Radius in a Simple Polygon
نویسندگان
چکیده
منابع مشابه
The Complexity of Diffuse Reflections in a Simple Polygon
The complexity of the visibility region formed by a point light source after k diffuse reflections in a simple n-sided polygon is O(n), which is the first result polynomial in n, with no dependence on k. This bound is an exponential improvement over the previous bound of O(n2d(k+1)/2e+1) due to Prasad et al. [8].
متن کاملDiffuse reflection diameter in simple polygons
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the maximum number of diffuse reflections needed for a point light source to illuminate the interior of a simple polygon with n walls is bn/2c − 1. Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular reflections.
متن کاملAn Algorithm for Computing Constrained Reflection Paths in Simple Polygon
Let s be a source point and t be a destination point inside an n-vertex simple polygon P . Euclidean shortest paths [Lee and Preparata, Networks, 1984; Guibas et al. , Algorithmica, 1987] and minimum-link paths [Suri, CVGIP, 1986; Ghosh, J. Algorithms, 1991] between s and t inside P have been well studied. Both these kinds of paths are simple and piecewise-convex. However, computing optimal pat...
متن کاملA Simple Polygon Triangulation Algorithm
In this Paper we propose an easily implementable polygon triangulation algorithm using Shortest Paths. The algorithm runs in O(nlogk) deterministic time with k < n 3 . Our algorithm runs in linear time for a large class of polygons. The biggest advantage of the algorithm is that it uses very simple data structures and it computes the triangulation just by scanning the boundary of the polygon. W...
متن کاملA simple kinetic visibility polygon
! " # %$& (') * + , -. ('0/ '1 2 3 %$4 52 /6 3 % & 4 7 89 & : ;< %$& = : > >;2'1 ; ? @ A CB*'1 = = : ;D E< -+'1 4 GFIH J K & = :5L /< = %$9 = 3 %$ M = 4 ON ,P 052 = ') ; M!'1 ; ? 0 Q ? = ? ! F Categories and Subject Descriptors R S TLS TJU V WYX1Z&[K\9Z0]_^_Z)`#acbed f4d g%Z)hji kmlmn0oKp*q1rOs*r(tKuvl p*w tKx=s*y=z4{3r oKn0|9}~x=t &p* { t {34p* 1s*yGqL 0M: & 3 / : = ? / %$ J 05
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0031-9